Combinatorial Circuits and the W-hierarchy
نویسندگان
چکیده
The classes of the W-hierarchy are the most important classes of intractable problems in parameterized complexity. These classes where originally defined via the weighted satisfiability problem for Boolean circuits. Here, besides the Boolean connectives we consider connectives like majority, not-all-equal, and unique. For example, a gate labelled by the majority connective outputs TRUE if more than half of its inputs are TRUE. For any finite set C of connectives we construct the corresponding W(C)-hierarchy. We derive some general conditions which guarantee that the W-hierarchy and the W(C)-hierarchy coincide levelwise. If C only contains the majority connective than the first levels of the hierarchies coincide. We use this to show that a variant of the parameterized vertex cover problem, the majority vertex cover problem, is W[1]-complete.
منابع مشابه
A Purely Democratic Characterization of W[1]
We give a novel characterization of W[1], the most important fixed-parameter intractability class in the W-hierarchy, using Boolean circuits that consist solely of majority gates. Such gates have a Boolean value of 1 if and only if more than half of their inputs have value 1. Using majority circuits, we define an analog of the W-hierarchy which we call the W̃-hierarchy, and show that W[1] = W̃[1]...
متن کاملCounting Hierarchies: Polynomial Time and Constant Depth Circuits
In the spring of 1989, Seinosuke Toda of the University of Electro-Communications in Tokyo, Japan, proved that the polynomial hierarchy is contained in P PP To-89]. In this Structural Complexity Column, we will brieey review Toda's result, and explore how it relates to other topics of interest in computer science. In particular, we will introduce the reader to The Counting Hierarchy: a hierarch...
متن کاملWeighting and prioritizing of indicators affecting resilience in the fire-induced emergencies in combined cycle power plant using fuzzy analytic hierarchy process
Abstract Background and Objective: Increasing the level of resilience is one of the approaches to reduce the consequences of fire. Resilience is one of the most important and practical concepts in crisis management that has been considered in recent years.The current study was aim to identify and prioritize of indicators affecting resilience in the event of fire-induced emergencies in combined...
متن کاملOn two-dimensional Cayley graphs
A subset W of the vertices of a graph G is a resolving set for G when for each pair of distinct vertices u,v in V (G) there exists w in W such that d(u,w)≠d(v,w). The cardinality of a minimum resolving set for G is the metric dimension of G. This concept has applications in many diverse areas including network discovery, robot navigation, image processing, combinatorial search and optimization....
متن کاملParameterized Circuit Complexity and the W Hierarchy
A parameterized problem 〈L, k〉 belongs to W [t] if there exists k′ computed from k such that 〈L, k〉 reduces to the weight-k′ satisfiability problem for weft-t circuits. We relate the fundamental question of whether the W [t] hierarchy is proper to parameterized problems for constant-depth circuits. We define classes G[t] as the analogues of AC depth-t for parameterized problems, and N [t] by we...
متن کامل